Parameterized Problems Related to Seidel's Switching

Complexity of Hypergraph Coloring and Seidel's Switching

Randomized Algorithms for the Separation of Point Sets and for Solving

A randomized algorithm for nding a hyperplane separating two nite point sets in the Euclidean space R d and a randomized algorithm for solving linearly constrained general convex quadratic problems are proposed. The expected running time of the separating algorithm is O(dd!(m + n)), where m and n are cardinalities of sets to be separated. The expected running time of the algorithm for solving q...

Some Parameterized Problems Related to Seidel’s Switching

Seidel’s switching of vertex set is an operation, which deletes edges leaving this set from the graph and adds those edges between the set and the rest of the graph, that weren’t there originally. Other edges remain untouched by this operation. The usual question in parameterized complexity is whether the exponential part of the algorithms for hard problems can be bounded by some function of on...

Fuzzy adaptive tracking control for a class of nonlinearly parameterized systems with unknown control directions

This paper addresses the problem of adaptive fuzzy tracking control for aclass of nonlinearly parameterized systems with unknown control directions.In this paper, the nonlinearly parameterized functions are lumped into the unknown continuous functionswhich can be approximated by using the fuzzy logic systems (FLS) in Mamdani type. Then, the Nussbaum-type function is used to de...

On the Complexity of Bounded Context Switching

Bounded context switching (BCS) is an under-approximate method for finding violations to safety properties in shared-memory concurrent programs. Technically, BCS is a reachability problem that is known to be NP-complete. Our contribution is a parameterized analysis of BCS. The first result is an algorithm that solves BCS when parameterized by the number of context switches (cs) and the size of ...